Railway timetabling: a maximum bottleneck path algorithm for finding an additional train path
نویسندگان
چکیده
منابع مشابه
Train Timetabling Problem for Complex Railway Systems
This paper deals with the design of timetables for complex railway systems. Rail transportation has become a rapid, clean and efficient way to transport passengers and freights. A good timetable design is crucial to ensure the quality of the services trying to improve the efficiency of the whole system. Only such a sustainable transportation system will be in accordance to the requirements of f...
متن کاملA Path - Finding Algorithm for Loop - Free
| A loop-free path-nding algorithm (LPA) is presented ; this is the rst routing algorithm that eliminates the formation of temporary routing loops without the need for internodal synchronization spanning multiple hops or the speciication of complete or variable-size path information. Like other previous algorithms, LPA operates by specifying the second-to-last hop and distance to each destinati...
متن کاملAn Algorithm for Finding a Long Path in a Graph
An algorithm is described which constructs a long path containing a selected vertex x in a graph G. In hamiltonian graphs, it often finds a hamilton cycle or path. The algorithm uses crossovers of order k ≤ M , where M is a fixed constant, to build a longer and longer path. The method is based on theoretical methods often used to prove graphs hamiltonian.
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملA path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Public Transport
سال: 2020
ISSN: 1866-749X,1613-7159
DOI: 10.1007/s12469-020-00253-x